Tim Roughgarden

Results: 191



#Item
171Numerical analysis / Mathematical analysis / Mathematical optimization / Convex analysis / Operations research / Convex optimization / Gradient descent / Derivative / Convex function / Linear programming / Gradient boosting / FrankWolfe algorithm

CS168: The Modern Algorithmic Toolbox Lecture #15: Gradient Descent Basics Tim Roughgarden & Gregory Valiant May 18,

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2015-05-27 17:30:42
172Game theory / Price of anarchy / Congestion game / Nash equilibrium / Strategy / General equilibrium theory / Solution concept / Algorithmic game theory / Correlated equilibrium / Zero-sum game / Price of stability / Folk theorem

Intrinsic Robustness of the Price of Anarchy Tim Roughgarden Department of Computer Science Stanford University 353 Serra Mall, Stanford, CA 94305

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2012-05-15 15:01:36
173Game theory / Decision theory / Gaming / Mathematics / Nash equilibrium / Correlated equilibrium / Strategy / Congestion game / Best response / Zero-sum game / Solution concept / Succinct game

Computing Correlated Equilibria in Multi-Player Games∗ Christos H. Papadimitriou† Tim Roughgarden‡ January 5, 2008

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2008-01-28 00:27:47
174

Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned TIM ROUGHGARDEN Stanford University This survey describes the approximately optimal mechanism design paradigm and uses it to investigate

Add to Reading List

Source URL: sigecom.org

Language: English - Date: 2014-12-16 17:33:19
    175

    Quantifying Inefficiency in Games and Mechanisms Tim Roughgarden (Stanford) 1

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2014-07-14 15:46:20
      176Mechanism design / Game theory / Auction theory / Auctions / Decision theory / Gaming / Vickrey auction / Auction / VickreyClarkeGroves auction / VickreyClarkeGroves mechanism / Virtual valuation / Random-sampling mechanism

      Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned TIM ROUGHGARDEN Stanford University This survey describes the approximately optimal mechanism design paradigm and uses it to investigate

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-11-26 15:35:14
      177Mechanism design / Auction theory / Auctions / Game theory / Probability distributions / Vickrey auction / VickreyClarkeGroves auction / Auction / Virtual valuation / Valuation / Distribution / Exponential distribution

      The Sample Complexity of Revenue Maximization Richard Cole ∗ Tim Roughgarden † Courant Institute

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2015-11-25 19:06:52
      178Game theory / Price of anarchy / Approximation algorithm / Mathematical optimization / Epsilon-equilibrium / Congestion game / Optimization problem / Computational complexity theory / Nash equilibrium / Mechanism design

      Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-08-06 18:53:57
      179Mathematics / Coding theory / Error detection and correction / Operations research / Physics / Discrete mathematics / Linear programming / Convex optimization / Low-density parity-check code / Parity / Linear code / Duality

      CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding∗ Tim Roughgarden† October 29,

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-11-28 08:18:54
      180Game theory / Price of anarchy / Congestion game / Nash equilibrium / Bayesian game / Strategy / Solution concept / Best response / Risk dominance / Correlated equilibrium / General equilibrium theory / Price of stability

      The Price of Anarchy in Games of Incomplete Information∗ Tim Roughgarden† April 18, 2014 Abstract We define smooth games of incomplete information. We prove an “extension theorem” for

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-04-19 00:58:55
      UPDATE